Mining Graph Topological Patterns: Finding Covariations among Vertex Descriptors
نویسندگان
چکیده
منابع مشابه
Local Pattern Detection in Attributed Graphs
We propose to mine the topology of a large attributed graph by finding regularities among vertex descriptors. Such descriptors are of two types: (1) the vertex attributes that convey the information of the vertices themselves and (2) some topological properties used to describe the connectivity of the vertices. These descriptors are mostly of numerical or ordinal types and their similarity can ...
متن کاملMining patterns from graph traversals
In data models that have graph representations, users navigate following the links of the graph structure. Conducting data mining on collected information about user accesses in such models, involves the determination of frequently occurring access sequences. In this paper, we examine the problem of nding traversal patterns from such collections. The determination of patterns is based on the gr...
متن کاملFinding all minimum-size separating vertex sets in a graph
We present a new algorithm based upon network flows for finding all minimum size separating vertex sets in an undirected graph. The sequential implementation of our algorithm runs in ®(mm(max(Mnk,knmmin(k,'In)),mQx(Mn,k2n3))) = 0 (2 kn3) time, where M is the number of minimum size separating vertex sets The parallel implementai 6 tion runs either in 0 (&logn) deterministic time using ©(M2n2 + k...
متن کاملFinding a central vertex in an HHD-free graph
In a graph G=(V; E), the eccentricity e(v) of a vertex v is max{d(v; u): u∈V}. The center of a graph is the set of vertices with minimum eccentricity. A house–hole–domino-free (HHD-free) graph is a graph which does not contain the house, the domino, and holes (cycles of length at least 2ve) as induced subgraphs. We present an algorithm which 2nds a central vertex of a HHD-free graph in O( 1:376...
متن کاملFinding minimum feedback vertex set in bipartite graph
We show that minimum feedback vertex set in a bipartite graph on n vertices can be found in 1.8621 · nO(1) time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2013
ISSN: 1041-4347
DOI: 10.1109/tkde.2012.154